Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
نویسندگان
چکیده
Multilevel algorithms are a successful class of optimisation techniqueswhich address themeshpartitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. In this paper we present an enhancement of the technique which uses imbalance to achieve higher quality partitions. We also present a formulation of the Kernighan-Lin partition optimisation algorithm which incorporates load-balancing. The resulting algorithm is tested against a different but related state-ofthe-art partitioner and shown to provide improved results.
منابع مشابه
Dynamic Load Balancing with theRe nement - Tree Partition
Dynamic load balancing is considered in the context of adaptive multilevel methods for partial diierential equations on networks of workstations or PCs. An approach that periodically repartitions the grid is taken. A partitioning algorithm based on the reenement tree of the adaptive grid is presented and analyzed in terms of the most important properties of grid partitioners.
متن کاملThe Reenement-tree Partition for Parallel Solution of Partial Diierential Equations
Dynamic load balancing is considered in the context of adaptive multilevel methods for partial diierential equations on distributed memory multiproces-sors. An approach that periodically repartitions the grid is taken. The important properties of a partitioning algorithm are presented and discussed in this context. A partitioning algorithm based on the reenement tree of the adaptive grid is pre...
متن کاملA refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected p...
متن کاملEvaluation of Parallel Domain Decomposition Algorithms
In this talk we describe and evaluate several heuristics for the parallel decomposition of data into n processors. This problem is usually cast as a graph partitioning problem, requiring that each processor have equal amount of data, and that inter-processor communication be minimized. Since this problem is NP-complete, several heuristics have been developed: combinatorial, geometric, spectral,...
متن کاملA Performance Characterization of Load Balancing Algorithms for Parallel SAMR Applications
We perform a comprehensive performance characterization of load balancing algorithms for parallel structured adaptive mesh refinement (SAMR) applications. Using SAMR, computational resources are dynamically concentrated to areas in need of a high accuracy. Because of the dynamic resource allocation, the workload must repeatedly be partitioned and distributed over the processors. For an efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 22 شماره
صفحات -
تاریخ انتشار 2000